From Textual Entailment to Knowledgeable Machines

نویسنده

  • Peter Clark
چکیده

Project Halo is a long-term endeavor to create ”knowledgeable machines”, systems containing large amounts of general and domain-specific knowledge in a computable form. As a medium-term target, our goal is to have the computer pass an elementary school science exam as written, and our approach heavily leverages textual entailment technology. Frequently, exam questions can be transformed into entailment problems in which the entailment is from texts (e.g., school textbooks) presenting the relevant general and scientific knowledge, and the entailment transformations include rules, also derived from texts, that encode appropriate scientific and general inferences. In this talk I will overview the project and describe the textual question-answering component in detail. I will also discuss how the semi-formal representations of text, generate on the fly for textual entailment decisions, might also be aggregated together into a persistent knowledge base – a small step from entailment technology towards the ultimate goal of knowledgeable machines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture Notes in Computer Science 7488

Ultimately we would like our machines to not only search and retrieve information, but also have some “understanding” of the material that they are manipulating so that they can better meet the user’s needs. In this talk, I will present our work in Project Halo to create an (iPad hosted) “knowledgeable biology textbook”, called Inquire. Inquire includes a formal, hand-crafted knowledge base enc...

متن کامل

Machine Learning with Semantic-Based Distances Between Sentences for Textual Entailment

This paper describes our experiments on Textual Entailment in the context of the Third Pascal Recognising Textual Entailment (RTE-3) Evaluation Challenge. Our system uses a Machine Learning approach with Support Vector Machines and AdaBoost to deal with the RTE challenge. We perform a lexical, syntactic, and semantic analysis of the entailment pairs . From this information we compute a set of s...

متن کامل

Learning Textual Entailment using SVMs and String Similarity Measures

We present the system that we submitted to the 3rd Pascal Recognizing Textual Entailment Challenge. It uses four Support Vector Machines, one for each subtask of the challenge, with features that correspond to string similarity measures operating at the lexical and shallow syntactic level.

متن کامل

Sagan in TAC2009: Using Support Vector Machines in Recognizing Textual Entailment and TE Search Pilot task

This paper describes the Sagan system in the context of the Fifth Pascal Recognizing Textual Entailment (RTE-5) Evaluation Challenge and the new Textual Entailment Search Pilot Task. The system employs a Support Vector Machine classifier with a set of 32 features, which includes lexical and semantic similarity for both two-way and three-way classification tasks. Additionally, we show an approac...

متن کامل

BUAP: Evaluating Compositional Distributional Semantic Models on Full Sentences through Semantic Relatedness and Textual Entailment

The results obtained by the BUAP team at Task 1 of SemEval 2014 are presented in this paper. The run submitted is a supervised version based on two classification models: 1) We used logistic regression for determining the semantic relatedness between a pair of sentences, and 2) We employed support vector machines for identifying textual entailment degree between the two sentences. The behaviour...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013